Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider a system with `m` resources of the s...
Start Learning for Free
Consider a system with `m` resources of the same type being shared by `n` processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only if
- a)the sum of the maximum need is greater than m + n
- b)the sum of the maximum need is less than m + n
- c)both 1 and 2
- d)neither 1 nor 2
Correct answer is option 'B'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Most Upvoted Answer
Consider a system with `m` resources of the same type being shared by ...
Introduction:
In a system with `m` resources of the same type being shared by `n` processes, deadlock can occur when processes indefinitely wait for resources held by other processes. To ensure the system is deadlock-free, certain conditions need to be met. The given question asks about the condition for a deadlock-free system based on the sum of the maximum need.
Explanation:
To understand the condition for a deadlock-free system, let's consider the scenario where each process has a maximum need for resources.
If the sum of the maximum need is greater than m:
If the sum of the maximum need for all processes is greater than the total available resources `m`, it indicates that the total demand for resources exceeds the system's capacity. In such a scenario, the system may face resource exhaustion, leading to a potential deadlock. This condition does not ensure a deadlock-free system.
If the sum of the maximum need is less than m:
If the sum of the maximum need for all processes is less than the total available resources `m`, it guarantees that the system has sufficient resources to fulfill the maximum need of each process. In this case, the system can allocate resources to all processes without any deadlock. This condition ensures a deadlock-free system.
Conclusion:
Based on the explanation above, it can be concluded that the system is deadlock-free if and only if the sum of the maximum need for all processes is less than the total available resources `m`. Therefore, option 'B' is the correct answer.
In a system with `m` resources of the same type being shared by `n` processes, deadlock can occur when processes indefinitely wait for resources held by other processes. To ensure the system is deadlock-free, certain conditions need to be met. The given question asks about the condition for a deadlock-free system based on the sum of the maximum need.
Explanation:
To understand the condition for a deadlock-free system, let's consider the scenario where each process has a maximum need for resources.
If the sum of the maximum need is greater than m:
If the sum of the maximum need for all processes is greater than the total available resources `m`, it indicates that the total demand for resources exceeds the system's capacity. In such a scenario, the system may face resource exhaustion, leading to a potential deadlock. This condition does not ensure a deadlock-free system.
If the sum of the maximum need is less than m:
If the sum of the maximum need for all processes is less than the total available resources `m`, it guarantees that the system has sufficient resources to fulfill the maximum need of each process. In this case, the system can allocate resources to all processes without any deadlock. This condition ensures a deadlock-free system.
Conclusion:
Based on the explanation above, it can be concluded that the system is deadlock-free if and only if the sum of the maximum need for all processes is less than the total available resources `m`. Therefore, option 'B' is the correct answer.
Free Test
FREE
| Start Free Test |
Community Answer
Consider a system with `m` resources of the same type being shared by ...
Suppose N = ∑ all Needsi, A = ∑ all Allocationsi, M = ∑ all maximum Needsi.
Assume that there is no deadlock in the given system. If there is a deadlock state, then A = m because there is only one kind of resource and it can either be requested or released at a time.
From the condition 1 and 2 we get, N + A = M < m + n. So, we get N < n. It shows that at least one process i that Needs = 0. From condition 1, one process can release at least 1 resource. Thus, there are n -1 processes sharing m resources. It is always true that no process will wait permanently. Hence, the given system is deadlock free.
Assume that there is no deadlock in the given system. If there is a deadlock state, then A = m because there is only one kind of resource and it can either be requested or released at a time.
From the condition 1 and 2 we get, N + A = M < m + n. So, we get N < n. It shows that at least one process i that Needs = 0. From condition 1, one process can release at least 1 resource. Thus, there are n -1 processes sharing m resources. It is always true that no process will wait permanently. Hence, the given system is deadlock free.
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
Consider a system with `m` resources of the same type being shared by `n` processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only ifa)the sum of the maximum need is greater than m + nb)the sum of the maximum need is less than m + nc)both 1 and 2d)neither 1 nor 2Correct answer is option 'B'. Can you explain this answer?
Question Description
Consider a system with `m` resources of the same type being shared by `n` processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only ifa)the sum of the maximum need is greater than m + nb)the sum of the maximum need is less than m + nc)both 1 and 2d)neither 1 nor 2Correct answer is option 'B'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider a system with `m` resources of the same type being shared by `n` processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only ifa)the sum of the maximum need is greater than m + nb)the sum of the maximum need is less than m + nc)both 1 and 2d)neither 1 nor 2Correct answer is option 'B'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider a system with `m` resources of the same type being shared by `n` processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only ifa)the sum of the maximum need is greater than m + nb)the sum of the maximum need is less than m + nc)both 1 and 2d)neither 1 nor 2Correct answer is option 'B'. Can you explain this answer?.
Consider a system with `m` resources of the same type being shared by `n` processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only ifa)the sum of the maximum need is greater than m + nb)the sum of the maximum need is less than m + nc)both 1 and 2d)neither 1 nor 2Correct answer is option 'B'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider a system with `m` resources of the same type being shared by `n` processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only ifa)the sum of the maximum need is greater than m + nb)the sum of the maximum need is less than m + nc)both 1 and 2d)neither 1 nor 2Correct answer is option 'B'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider a system with `m` resources of the same type being shared by `n` processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only ifa)the sum of the maximum need is greater than m + nb)the sum of the maximum need is less than m + nc)both 1 and 2d)neither 1 nor 2Correct answer is option 'B'. Can you explain this answer?.
Solutions for Consider a system with `m` resources of the same type being shared by `n` processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only ifa)the sum of the maximum need is greater than m + nb)the sum of the maximum need is less than m + nc)both 1 and 2d)neither 1 nor 2Correct answer is option 'B'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Consider a system with `m` resources of the same type being shared by `n` processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only ifa)the sum of the maximum need is greater than m + nb)the sum of the maximum need is less than m + nc)both 1 and 2d)neither 1 nor 2Correct answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Consider a system with `m` resources of the same type being shared by `n` processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only ifa)the sum of the maximum need is greater than m + nb)the sum of the maximum need is less than m + nc)both 1 and 2d)neither 1 nor 2Correct answer is option 'B'. Can you explain this answer?, a detailed solution for Consider a system with `m` resources of the same type being shared by `n` processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only ifa)the sum of the maximum need is greater than m + nb)the sum of the maximum need is less than m + nc)both 1 and 2d)neither 1 nor 2Correct answer is option 'B'. Can you explain this answer? has been provided alongside types of Consider a system with `m` resources of the same type being shared by `n` processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only ifa)the sum of the maximum need is greater than m + nb)the sum of the maximum need is less than m + nc)both 1 and 2d)neither 1 nor 2Correct answer is option 'B'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Consider a system with `m` resources of the same type being shared by `n` processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only ifa)the sum of the maximum need is greater than m + nb)the sum of the maximum need is less than m + nc)both 1 and 2d)neither 1 nor 2Correct answer is option 'B'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup